منابع مشابه
Lazy Linear Combinatorial Unification
In this paper we deene a two-rule reduction system for the lazy computation of uniication on rst-order terms. The computation consists of a sequence of reductions which is almost linear with the size of the input. Every reduction transforms the problem into an equivalent one which is a better approximation of the solution. The approach is based on a combinatorial system which provides abstracti...
متن کاملLinear Second-Order Unification
We present a new class of second-order unification problems, which we have called linear. We deal with completely general second-order typed unification problems, but we restrict the set of unifiers under consideration: they instantiate free variables by linear terms, i.e. terms where any λ-abstractions bind one and only one occurrence of a bound variable. Linear second-order unification proper...
متن کاملLinear Higher-Order Pre-Unification
We develop an efficient representation and a pre-unification algorithm in the style of Huet for the This extended abstract has been submitted to the Twelfth Annual Symposium on Logic in Computer Science LICS’97, Warsaw, Poland, June 29th – July 2nd 1997. linear λ-calculus λ→−◦&> which includes intuitionistic functions (→), linear functions (−◦), additive pairing (&), and additive unit (>). Appl...
متن کاملFast Left-Linear Semi-Unification
Semi-unification is a generalization of both unification and matching with applications in proof theory, term rewriting systems, polymorphic type inference, and natural language processing. It is the problem of solving a set of term inequalities M1 ≤ N1, . . . ,Mk ≤ Nk, where ≤ is interpreted as the subsumption preordering on (first-order) terms. Whereas the general problem has recently been sh...
متن کاملHandling Linear Precedence Constraints by Unification
Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. Since they only order siblings, they are not quite adequate, at least not for German. We propose a notion of LP constraints that applies to linguistically motivated branching domains such as head domains. We show a type...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1978
ISSN: 0022-0000
DOI: 10.1016/0022-0000(78)90043-0